A Note on the Congruence Proof for Recursion in Markovian Bisimulation Equivalence
نویسندگان
چکیده
This note repairs some inaccuracies in the congruence proof for recursion previously developed for Marko-vian bisimulation equivalence. We provide a revised proof based on standard machinery obtained by smoothly extending Milner's technique based on bisimulation up to. The machinery we introduce for EMPA can be easily adapted in order to obtain accurate proofs for any other Markovian process algebra.
منابع مشابه
Corrigendum to "A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time" - [TCS 202 (1998) 1-54]
In [4] we presented a tutorial on the stochastically timed process algebra EMPA together with the related theory: semantics, equivalence, and axiomatization. The purpose of this note is to remedy to two errors contained in that paper which are related to the strong extended Markovian bisimulation equivalence ∼EMB defined for EMPA. The first error is contained in the proof of the congruence prop...
متن کاملNon-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is that Markovian bisimilarity is consistent with ordinary lumping. The latter is an aggregation for Markov chains that is exact, hence it guarantees the preservation of the performance characteristics across Markovian bisi...
متن کاملMarkovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besides being a congruence, Markovian bisimilarity is consistent with ordinary lumping, an exact aggregation for Markov chains. In this paper we show that two non-bisimulation-based Markovian behavioral equivalences – Marko...
متن کاملCharacterizing Bisimulation Congruence in the {Calculus
This paper presents a new characterization of the bisimulation congruence and D{bisimulation equivalences of the {calculus. The characterization supports a bisimulation{like proof technique which avoids explicit case analysis by taking a dynamic point of view of actions a process may perform , thus providing a new way of proving bisimulation congruence. The semantic theory of the {calculus is p...
متن کاملWeak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes
We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, which reduces sequences of exponentially timed internal actions to individual exponentially timed internal actions having the same average duration and execution probability as the corresponding sequences. This weak Markovian bisimulation equivalence is a congruence for sequential processes with ab...
متن کامل